A separation logic for the π-calculus
نویسندگان
چکیده
Reasoning about concurrent processes requires distinguishing communication from interference, and is especially difficult when the means of interaction change over time. We present a new logic for the π-calculus that combines temporal and separation logic, and treats channels as resources that can be gained and lost by processes. The resource model provides a lightweight way to constrain interference. By interpreting process terms as formulas, our logic directly supports compositional reasoning.
منابع مشابه
A resource analysis of the pi-calculus
We give a new treatment of the π-calculus based on the semantic theory of separation logic, continuing a research program begun by Hoare and O’Hearn. Using a novel resource model that distinguishes between public and private ownership, we refactor the operational semantics so that sending, receiving, and allocating are commands that influence owned resources. These ideas lead naturally to two d...
متن کاملA Resource Analysis of the π-calculus
We give a new treatment of the π-calculus based on the semantic theory of separation logic, continuing a research program begun by Hoare and O’Hearn. Using a novel resource model that distinguishes between public and private ownership, we refactor the operational semantics so that sending, receiving, and allocating are commands that influence owned resources. These ideas lead naturally to two d...
متن کاملSeparation Logic Semantics for Communicating Processes
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for separation in time as well as separation in space. It extends CSP in the direction of the pi-calculus: dynamic change of alphabet is achieved by communication of channel names. Separation is exploited to ensure that each c...
متن کاملImplicative Logic based translations of the λ-calculus into the π-calculus
We study an output-based translation of the λ-calculus with explicit substitution into the synchronous π-calculus – enriched with pairing – that has its origin in mathematical logic, and show that this translation respects reduction. We will define the notion of (explicit) head reduction -which encompasses (explicit) lazy reductionand show that the translation fully represents this reduction in...
متن کاملSpatial Logics for Bigraphs
Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. With the aim of describing bigraphical structures, we introduce a general framework for logics whose terms represent arrows in monoidal categories. We the...
متن کامل